Ecai-96 Workshop 27 Partial Satisfaction of Constraint Hierarchies in Reactive and Interactive Connguration
نویسنده
چکیده
Experience in applying expert systems revealed that there is usually a signi cant gap between the problem in the expert's mind and its formal speci cation. Thus, real-world con guration and scheduling problems often require a close dialogue between an expert and the expert system during the con guration process in order to bridge this gap. The expert must be able to re ne and correct the problem speci cation incrementally because the initial speci cation may comprise con icts or be underspeci ed. This paper suggests to employ various kinds of soft constraints embedded into constraint hierarchies (HCSP) in order to deal with problems arising from con icting and under-determined problem speci cations. The HCSP framework integrates certain constraint processing techniques with a high impact on user-interaction in con guration systems. A special notion of arc-consistency is applicable to inform about con icting requirements during the speci cation process. In contrast to well known approaches the expert is not necessarily prevented from making inconsistent decisions, because preferences and assumptions typically are inconsistent. Additionally, local searching algorithms are appropriate to improve a given solution that has not all the preferred properties. The applicability of both techniques is discussed and assessed by empirical studies. 1
منابع مشابه
Interactive Connguration Using Constraint Satisfaction Techniques
In this paper, we focus on techniques for incremental constraint-based conngu-ration with discrete and continuous variables. We show how to formalize constraint knowledge using compatibility and activity constraints (Mittal 1990) and how this knowledge is used for reasoning within an intelligent CAD system. Most technical (as opposed to spatial) constraint connguration systems use algorithms fo...
متن کاملWLP 2000, 15th Workshop on Logic Programming and Constraint Systems, Collocated ECAI 2000 Workshop, Berlin, August 25-27, 2000
متن کامل
Connguration as Composite Constraint Satisfaction
Selecting and arranging parts is the core of a conngu-ration task. The validity of a connguration is deened in terms of constraints. Highly declarative, domain independent and simple to use, the constraint satisfaction problem (CSP) paradigm ooers an adequate framework for this task. However, the basic paradigm is not powerful enough to capture or to take advantage of essential aspects of conng...
متن کاملFinding Regions for Local Repair in Partial CSP Solutions
In contrast to standard constraint satisfaction problems (CSPs) practical applications often require both, the management of changing validity of constraints and variables. Based on experiences made with the development of a commercial nurse scheduling system this paper suggests the application of local optimization algorithms for knowledge-based connguration systems, which strongly rely on dyn...
متن کاملGenerating Tradeoos for Interactive Constraint-based Connguration
In this paper we have modeled tradeoos in constraint-based connguration as additional constraints, and begun to study the issues involved in generating and evaluating such tradeoos. We describe our basic approach in the context of a \toy" connguration problem based on the classic N-Queens problem. Initial experiments compare \proposal strategies" for generating tradeoos. We demonstrate that arc...
متن کامل